Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
نویسندگان
چکیده
Most computational work in Jacobi-Davidson [9], an iterative method for large scale eigenvalue problems, is due to a so-called correction equation. In [5] a strategy for the approximate solution of the correction equation was proposed. This strategy is based on a domain decomposition preconditioning technique in order to reduce wall clock time and local memory requirements. This report discusses the aspect that the original strategy can be improved. For large scale eigenvalue problems that need a massively parallel treatment this aspect turns out to be nontrivial. The impact on the parallel performance will be shown by results of scaling experiments up to 1024 cores. 2000 Mathematics Subject Classification: 65F15; 65N25; 65F10; 65N55; 65Y05
منابع مشابه
Using Domain Decomposition in the
The Jacobi-Davidson method is suitable for computing solutions of large n-dimensional eigenvalue problems. It needs (approximate) solutions of speciic n-dimensional linear systems. Here we propose a strategy based on a nonoverlapping domain decomposition technique in order to reduce the wall clock time and local memory requirements. For a model eigenvalue problem we derive optimal coupling para...
متن کاملA parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc’s efficient and various parallel operations, linear so...
متن کاملInexact Newton Preconditioning Techniques for Large Symmetric Eigenvalue Problems
This paper studies a number of Newton methods and use them to define new secondary linear systems of equations for the Davidson eigenvalue method. The new secondary equations avoid some common pitfalls of the existing ones such as the correction equation and the Jacobi-Davidson preconditioning. We will also demonstrate that the new schemes can be used efficiently in test problems.
متن کاملPreconditioning Eigenvalues and Some Comparison of Solvers
Preconditioning techniques are discussed for symmetric eigenvalue problems. The methods Davidson, Jacobi-Davidson, Rayleigh quotient iteration, and preconditioned Lanczos are considered. Some relationships are given between these different approaches, and some experimental comparisons are done. Jacobi-Davidson appears to be efficient in both expense and storage. A hybrid method may be helpful f...
متن کاملComputational experience with sequential and parallel, preconditioned Jacobi–Davidson for large, sparse symmetric matrices
The Jacobi–Davidson (JD) algorithm was recently proposed for evaluating a number of the eigenvalues of a matrix. JD goes beyond pure Krylov-space techniques; it cleverly expands its search space, by solving the so-called correction equation, thus in principle providing a more powerful method. Preconditioning the Jacobi–Davidson correction equation is mandatory when large, sparse matrices are an...
متن کامل